Imbalance parameterized by twin cover revisited

Imbalance is a classical graph layout problem with several applications, particularly in drawing. The imbalance of σ determined by how well-balanced the neighbors vertices are σ. In present work, we study parameterized twin cover graph. We show that XP cover, and FPT when size largest clique outside cover. contrast, introduce notion succinct representations graphs terms their demonstrate NP-hard setting representations, even for have one.